Reminiscences of Peter, by P. Oppenheim.--Natural kinds, by W. V. Quine.--Inductive independence and the paradoxes of confirmation, by J. Hintikka.--Partial entailment as a basis for inductive logic, by W. C. Salmon.--Are there non-deductive logics?, by W. Sellars.--Statistical explanation vs. statistical inference, by R. C. Jeffre--Newcomb's problem and two principles of choice, by R. Nozick.--The meaning of time, by A. Grünbaum.--Lawfulness as mind-dependent, by N. Rescher.--Events and their descriptions: some considerations, by J. Kim.--The individuation of events, by D. Davidson.--On properties, by (...) H. Putnam.--A method for avoiding the Curry paradox, by F. B. Fitch.--Publications (1934-1969) by Carl G. Hempel (p. [266]-270). (shrink)

Genuine religion always involves the worship of what is genuinely ultimate. Religion, worship, and ultimate reality are thus indissolubly related. The task of reflective thought in this domain is to distinguish what is sound from what is spurious in religion; to characterise the meaning of religious devotion; and to attempt to articulate the nature of the ultimate reality to which men's worship is directed.

The so-called "non-commutativity" of probability kinematics has caused much unjustified concern. When identical learning is properly represented, namely, by identical Bayes factors rather than identical posterior probabilities, then sequential probability-kinematical revisions behave just as they should. Our analysis is based on a variant of Field's reformulation of probability kinematics, divested of its (inessential) physicalist gloss.

It is shown that for every nonzero r.e. degree c there is a linear ordering of degree c which is not isomorphic to any recursive linear ordering. It follows that there is a linear ordering of low degree which is not isomorphic to any recursive linear ordering. It is shown further that there is a linear ordering L such that L is not isomorphic to any recursive linear ordering, and L together with its ‘infinitely far apart’ relation is of low (...) degree. Finally, an analogue of the recursion theorem for recursive linear orderings is refuted. (shrink)

The fundamental tenet of modern empiricism is the view that all non-analytic knowledge is based on experience. Let us call this thesis the principle of empiricism. [1] Contemporary logical empiricism has added [2] to it the maxim that a sentence makes a cognitively meaningful assertion, and thus can be said to be either true or false, only if it is either (1) analytic or self-contradictory or (2) capable, at least in principle, of experiential test. According to this so-called empiricist criterion (...) of cognitive meaning, or of cognitive significance, many of the formulations of traditional metaphysics and large parts of epistemology are devoid of cognitive significance--however rich some of them may be in non-cognitive import by virtue of their emotive appeal or the moral inspiration they offer. Similarly certain doctrines which have been, at one time or another, formulated within empirical science or its border disciplines are so contrived as to be incapable of test by any conceivable evidence; they are therefore qualified as pseudo- [p. 42:] hypotheses, which assert nothing, and which therefore have no explanatory or predictive force whatever. This verdict applies, for example, to the neo-vitalist speculations about entelechies or vital forces, and to the "telefinalist hypothesis" propounded by Lecomte du Noüy. (shrink)

We establish a probabilized version of modus tollens, deriving from p(E|H)=a and p()=b the best possible bounds on p(). In particular, we show that p() 1 as a, b 1, and also as a, b 0. Introduction Probabilities of conditionals Conditional probabilities 3.1 Adams' thesis 3.2 Modus ponens for conditional probabilities 3.3 Modus tollens for conditional probabilities.

It has often been recommended that the differing probability distributions of a group of experts should be reconciled in such a way as to preserve each instance of independence common to all of their distributions. When probability pooling is subject to a universal domain condition, along with state-wise aggregation, there are severe limitations on implementing this recommendation. In particular, when the individuals are epistemic peers whose probability assessments are to be accorded equal weight, universal preservation of independence is, with a (...) few exceptions, impossible. Under more reasonable restrictions on pooling, however, there is a natural method of preserving the independence of any fixed finite family of countable partitions, and hence of any fixed finite family of discrete random variables. (shrink)

Jeffrey has devised a probability revision method that increases the probability of hypothesis H when it is discovered that H implies previously known evidence E. A natural extension of Jeffrey's method likewise increases the probability of H when E has been established with sufficiently high probability and it is then discovered, quite apart from this, that H confers sufficiently higher probability on E than does its logical negation H̄.

Additional results are reported on the author's earlier generalization of Richard Jeffrey's solution to the problem of old evidence and new explanation.

This reappraisal of the middle section of Augustine's Confessions covers the period of Augustine's conversion to Christianity. The author argues against the prevailing Neoplatonic interpretation of Augustine.

This is a volume of twelve essays published in the successful tradition of _Essays in Philosophy_. These essays in metaphysics merge the eternal, the historical, and the immediately encountered dimensions of man’s experience to illustrate what is permanently valuable in the tradition of Western thought. Contributors: John M. Anderson; Karel Berka; Hiram Canton; Joseph C. Flay; Richard A Gotshalk; Carl R. Hausman; Henry W. Johnstone, Jr.; Joseph J. Kockelmans; Robert G. Price; Stanley H. Rosen; Albert Tsugawa; Carl G. (...) Vaught. (shrink)

We show, roughly speaking, that it requires ω iterations of the Turing jump to decode nontrivial information from Boolean algebras in an isomorphism invariant fashion. More precisely, if α is a recursive ordinal, A is a countable structure with finite signature, and d is a degree, we say that A has αth-jump degree d if d is the least degree which is the αth jump of some degree c such there is an isomorphic copy of A with universe ω in (...) which the functions and relations have degree at most c. We show that every degree d ≥ 0 (ω) is the ωth jump degree of a Boolean algebra, but that for $n no Boolean algebra has nth-jump degree $\mathbf{d} > 0^{(n)}$ . The former result follows easily from work of L. Feiner. The proof of the latter result uses the forcing methods of J. Knight together with an analysis of various equivalences between Boolean algebras based on a study of their Stone spaces. A byproduct of the proof is a method for constructing Stone spaces with various prescribed properties. (shrink)

Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We define an arguably more natural notion called weak stability, and we study the existence of infinite computable or low chains or antichains, and of infinite $\Pi _1^0 $ chains and antichains, in infinite computable stable and weakly stable posets. For example, we extend a result of Hirschfeldt and Shore to show that every infinite computable weakly stable poset contains either an infinite low chain or an infinite computable (...) antichain. Our hardest result is that there is an infinite computable weakly stable poset with no infinite $\Pi _1^0 $ chains or antichains. On the other hand, it is easily seen that every infinite computable stable poset contains an infinite computable chain or an infinite $\Pi _1^0 $ antichain. In Reverse Mathematics, we show that SCAC, the principle that every infinite stable poset contains an infinite chain or antichain, is equivalent over RCA₀ to WSCAC, the corresponding principle for weakly stable posets. (shrink)

A new interpretation of the first six books of Augustine's Confessions, emphasizing the importance of Christianity rather than Neoplatonism.

It is shown that for any computable field K and any r.e. degree a there is an r.e. set A of degree a and a field F ≅ K with underlying set A such that the field operations of F (including subtraction and division) are extendible to (total) recursive functions. Further, it is shown that if a and b are r.e. degrees with b ≤ a, there is a 1-1 recursive function $f: \mathbb{Q} \rightarrow \omega$ such that f(Q) ∈ a, (...) f(Z) ∈ b, and the images of the field operations of Q under f can be extended to recursive functions. (shrink)

A simple rule of probability revision ensures that the final result of a sequence of probability revisions is undisturbed by an alteration in the temporal order of the learning prompting those revisions. This Uniformity Rule dictates that identical learning be reflected in identical ratios of certain new-to-old odds, and is grounded in the old Bayesian idea that such ratios represent what is learned from new experience alone, with prior probabilities factored out. The main theorem of this paper includes as special (...) cases Field's theorem on commuting probability-kinematical revisions and the equivalence of two strategies for generalizing Jeffrey 's solution to the old evidence problem to the case of uncertain old evidence and probabilistic new explanation. (shrink)

Jeffrey conditionalization is generalized to the case in which new evidence bounds the possible revisions of a prior below by a Dempsterian lower probability. Classical probability kinematics arises within this generalization as the special case in which the evidentiary focal elements of the bounding lower probability are pairwise disjoint.